Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds

نویسندگان

چکیده

We consider optimization problems on Riemannian manifolds with equality and inequality constraints, which we call nonlinear (RNLO) problems. Although they have numerous applications, the existing studies them are limited especially in terms of algorithms. In this paper, propose sequential quadratic (RSQO) that uses a line-search technique an $\ell_{1}$ penalty function as extension standard SQO algorithm for constrained Euclidean spaces to manifolds. prove its global convergence Karush--Kuhn--Tucker point RNLO problem by means parallel transport exponential mapping. Furthermore, establish local analyzing relationship between sequences generated RSQO Newton method. Ours is first has both properties Empirical results show finds solutions more stably higher accuracy compared augmented Lagrangian methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Inexact Sequential Quadratic Optimization Algorithm for Nonlinear Optimization

We propose a sequential quadratic optimization method for solving nonlinear optimization problems with equality and inequality constraints. The novel feature of the algorithm is that, during each iteration, the primal-dual search direction is allowed to be an inexact solution of a given quadratic optimization subproblem. We present a set of generic, loose conditions that the search direction (i...

متن کامل

Optimization Techniques on Riemannian Manifolds

The techniques and analysis presented in this paper provide new methods to solve optimization problems posed on Riemannian manifolds. A new point of view is offered for the solution of constrained optimization problems. Some classical optimization techniques on Euclidean space are generalized to Riemannian manifolds. Several algorithms are presented and their convergence properties are analyzed...

متن کامل

Vector optimization problems under d-invexity on Riemannian manifolds

The concept of d−invexity for functions defined on Riemannian manifolds is introduced. Then, this notion is used to obtain optimality conditions for vector optimization problems on Riemannian manifolds. M.S.C. 2010: 58E17, 90C26.

متن کامل

Sequential Quadratic Programming forLarge - Scale Nonlinear Optimization ?

The sequential quadratic programming (SQP) algorithm has been one of the most successful general methods for solving nonlinear constrained optimization problems. We provide an introduction to the general method and show its relationship to recent developments in interior-point approaches. We emphasize large-scale aspects.

متن کامل

Semivectorial Bilevel Optimization on Riemannian Manifolds

In this paper we deal with the semivectorial bilevel problem in the Riemannian setting. The upper level is a scalar optimization problem to be solved by the leader, and the lower level is a multiobjective optimization problem to be solved by several followers acting in a cooperative way inside the greatest coalition and choosing among Pareto solutions with respect to a given ordering cone. For ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Siam Journal on Optimization

سال: 2022

ISSN: ['1095-7189', '1052-6234']

DOI: https://doi.org/10.1137/20m1370173